An Incomplete Factorization Preconditioning Method for Fem-discretized Partial Diierential Equations Based on Modiication of Element Matrices
نویسنده
چکیده
It is well known that standard incomplete factorization (IC) methods exist for M-matrices 14] and that modiied incomplete factorization (MIC) methods exist for weakly diagonally dominant matrices 8]. The restriction to these classes of matrices excludes many realistic general applications to discretized partial diieren-tial equations. We present a technique to avoid this problem by making an initial modiication already at the element level, followed by the standard IC or MIC fac-torization of the assembled matrix. This modiication ensures weakly diagonally dominant M-matrices and is made in such a way that the condition number of the matrix is only increased by a constant factor independent of the mesh parameter h. Hence, the fast convergence of the MICCG method, that is in O(h ?1=2); h ! 0 iterations for second order elliptic problems, is preserved.
منابع مشابه
Scallability Analysis of Parallel Mic(0) Preconditioning Algorithm for 3d Elliptic Problems
Novel parallel algorithms for the solution of large FEM linear systems arising from second order elliptic partial differential equations in 3D are presented. The problem is discretized by rotated trilinear nonconforming Rannacher–Turek finite elements. The resulting symmetric positive definite system of equations Ax = f is solved by the preconditioned conjugate gradient algorithm. The precondit...
متن کاملParallel MIC(0) preconditioning of 3D elliptic problems discretized by Rannacher-Turek finite elements
Novel parallel algorithms for the solution of large FEM linear systems arising from second order elliptic partial differential equations in 3D are presented. The problem is discretized by rotated trilinear nonconforming Rannacher–Turek finite elements. The resulting symmetric positive definite system of equations Ax = f is solved by the preconditioned conjugate gradient algorithm. The precondit...
متن کاملParallel Preconditioning Techniques for Sparse CG Solvers
Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial diierential equations. The large size and the condition of many technical or physical applications in this area result in the need for eecient par-allelization and preconditioning techniques of the CG method. In particular for very ill-condition...
متن کاملComparative Analysis of Mesh Generators and MIC(0) Preconditioning of FEM Elasticity Systems
In this study, the topics of grid generation and FEM applications are studied together following their natural synergy. We consider the following three grid generators: Triangle, NETGEN and Gmsh. The quantitative analysis is based on the number of elements/nodes needed to obtain a triangulation of a given domain, satisfying a certain minimal angle condition. After that, the performance of two d...
متن کاملComparative Analysis of High Performance Solvers for 3D Elliptic Problems
The presented comparative analysis concerns two iterative solvers for 3D linear boundary value problems of elliptic type. After applying the Finite Difference Method (FDM) or the Finite Element Method (FEM) discretization a system of linear algebraic equations has to be solved, where the stiffness matrix is large, sparse and symmetric positive definite. It is well known that the preconditioned ...
متن کامل